Nuprl Lemma : length_disjoint_sublists
4,23
postcript
pdf
T
:Type,
L1
,
L2
,
L
:
T
List. disjoint_sublists(
T
;
L1
;
L2
;
L
)
||
L1
||+||
L2
||
||
L
||
latex
Definitions
t
T
,
x
:
A
.
B
(
x
)
,
disjoint_sublists(
T
;
L1
;
L2
;
L
)
,
||
as
||
,
P
Q
,
False
,
A
,
A
B
,
i
j
,
,
P
&
Q
,
{
i
..
j
}
,
Inj(
A
;
B
;
f
)
,
x
:
A
.
B
(
x
)
Lemmas
disjoint
sublists
witness
,
inject
wf
,
int
seg
wf
,
injection
le
,
non
neg
length
,
length
wf1
,
disjoint
sublists
wf
origin
T:Type, L1, L2, L:T List. disjoint_sublists(T;L1;L2;L) 
||L1||+||L2||
||L|| T:Type, L1, L2, L:T List. disjoint_sublists(T;L1;L2;L) ||L1||+||L2||||L|| 
Tx:A. B(x) Q
AB
j
}
x:A. B(x)